Eecient Leader Election Using Sense of Direction *
نویسنده
چکیده
This paper presents a protocol for leader election in complete networks with a sense of direction. Sense of direction provides nodes the capability of distinguishing between their incident links according to a global scheme. We propose a protocol for leader election which requires O(N) messages and O(log N) time. The protocol is message optimal and the time complexity is a signiicant improvement over currently known protocols for this problem.
منابع مشابه
Linear Broadcasting and N loglog N Election in Unoriented Hypercubes
In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by expl...
متن کاملAn Improved Leader Election Protocol in Multi-hop Radio Networks
This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our el...
متن کاملOptimal Distributed Algorithms in Unlabelled Tori and Chordal Rings
We study the message complexity of distributed algorithms in Tori and Chordal Rings when the communication links are unlabelled, which implies that the processors do not have a globally consistent labelling of the communication links. They have no \Sense of Direction" but have only a topological awareness. We use a preprocessing algorithm to introduce the notion of handrail, a partial structura...
متن کاملOptimal Elections in Labeled Hypercubes
We study the message complexity of the Election Problem in Hypercube networks , when the processors have a \Sense of Direction", i.e., the capability to distinguish between adjacent communication links according to some globally consistent scheme. We present two models of Sense of Direction, which diier regarding the way the labeling of the links in the network is done: either by matching based...
متن کاملOptimal Elections in Faulty Loop Networks and Applications
Loop networks (or Hamiltonian circulant graphs) are a popular class of faulttolerant network topologies which include rings and complete graphs. For this class, the fundamental problem of Leader Election has been extensively studied assuming either a fault-free system or an upper-bound on the number of link failures. We consider loop networks where an arbitrary number of links has failed and a ...
متن کامل